Analysis of neutrosophic multiple regression

The idea of Neutrosophic statistics is utilized for the analysis of the uncertainty observation data. Neutrosophic multiple regression is one of a vital roles in the analysis of the impact between the dependent and independent variables. The Neutrosophic regression equation is useful to predict the future value of the dependent variable. This paper to predict the students' performance in campus interviews is based on aptitude and personality tests, which measures conscientiousness, and predict the future trend. Neutrosophic multiple regression is to authenticate the claim and examine the null hypothesis using the F-test. This study exhibits that Neutrosophic multiple regression is the most efficient model for uncertainty rather than the classical regression model

Interval Valued Neutrosophic Shortest Path Problem by A* Algorithm

Many researchers have been proposing various algorithms to unravel different types of fuzzy shortest path problems. There are many algorithms like Dijkstra’s, Bellman-Ford,Floyd-Warshall and kruskal’s etc are existing for solving the shortest path problems. In this work a shortest path problem with interval valued neutrosophic numbers is investigated using the proposed algorithm. A* algorithm is extensively applied in pathfinding and graph traversal.Unlike the other algorithms mentioned above, A* algorithm entails heuristic function to uncover the cost of path that traverses through the particular state. In the structured work A* algorithm is applied to unravel the length of the shortest path by utilizing ranking function from the source node to the destination node. A* algorithm is executed by applying best first search with the help of this search, it greedily decides which vertex to investigate subsequently. A* is equally complete and optimal if an acceptable heuristic is concerned. The arc lengths in interval valued neutrosophic numbers are defuzzified using the score function.. A numerical example is used to illustrate the proposed approach

Blockchain single and interval valued neutrosophic graphs

Blockchain Technology (BCT) is a growing and reliable technology in various fields such as developing business deals, economic environments, social and politics as well. Without having a trusted central party this technology, gives the guarantee for safe and reliable transactions using Bitcoin or Ethereum. In this paper BCT has been considered using Bitcoins. Also Blockchain Single and Interval Valued Neutrosophic Graphs have been proposed and applied in transaction of Bitcoins. Also degree, total degree, minimum and maximum degree have been found for the proposed graphs. Further, comparative analysis is done with advantages and limitations of different types of Blockchain graphs

Characterizations of Strong and Balanced Neutrosophic Complex Graphs

In this paper, the concepts of neutrosophic complex graph, complete neutrosophic complex graph, strong neutrosophic complex graph, balanced neutrosophic complex graph and strictly balanced neutrosophic complex graph are introduced. Some of the interesting properties and related examples are established

Dombi Interval Valued Neutrosophic Graph and its Role in Traffic Control Management

An advantage of dealing indeterminacy is possible only with Neutrosophic Sets. Graph theory plays a vital role in the field of networking. If uncertainty exist in the set of vertices and edge then that can be dealt by fuzzy graphs in any application and using Neutrosophic Graph uncertainty of the problems can be completely dealt with the concept of indeterminacy

Uniform Single Valued Neutrosophic Graphs

In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph

On single-valued co-neutrosophic graphs

In this paper, we introduce the notion of a single-valued co-neutrosophic graphs and study some methods of construction of new single-valued co-neutrosophic graphs. We compute degree of a vertex, strong single-valued co-neutrosophic graphs and complete single-valued co-neutrosophic graphs. We also introduce and give properties of regular and totally regular single-valued co-neutrosophic graphs

Neutrosophic Shortest Path Problem

Neutrosophic set theory provides a new tool to handle the uncertainties in shortest path problem (SPP). This paper introduces the SPP from a source node to a destination node on a neutrosophic graph in which a positive neutrosophic number is assigned to each edge as its edge cost. We define this problem as neutrosophic shortest path problem (NSSPP). A simple algorithm is also introduced to solve the NSSPP. The proposed algorithm finds the neutrosophic shortest path (NSSP) and its corresponding neutrosophic shortest path length (NSSPL) between source node and destination node. Our proposed algorithm is also capable to find crisp shortest path length (CrSPL) of the corresponding neutrosophic shortest path length (NSSPL) which helps the decision maker to choose the shortest path easily. We also compare our proposed algorithm with some existing methods to show efficiency of our proposed algorithm. Finally, some numerical experiments are given to show the effectiveness and robustness of the new model. Numerical and graphical results demonstrate that the novel methods are superior to the existing method